Algorithm and Design Complexity by unknow

Author:unknow
Language: eng
Format: epub
Publisher: Taylor & Francis Group
Published: 2023-06-15T00:00:00+00:00

Example 3.1 Knapsack

The solution to the knapsack problem can be viewed as the result of a sequence of decisions. We have to decide the values of Xi, 1 ≤ I ≤ n. First, we make a decision on X1, then on X2, then on X3, and so on. An optimal sequence of decisions maximizes the objective function ∑ PiXi.

Example 3.2 Optimal Merge Patterns

An optimal merge pattern tells us which pair of files should be merged at each step. The solution to an optimal merge pattern using dynamic programming is to decide which pair of files should be merged first, which pair second, which pair third, and so on. An optimal sequence of decisions is a least-cost sequence.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.